A Jacobian-free Newton-krylov Iterative Scheme for Criticality Calculations Based on the Neutron Diffusion Equation

نویسندگان

  • D. F. Gill
  • Y. Y. Azmy
چکیده

Newton-Krylov methods, primarily using the Jacobian-Free Newton-Krylov (JFNK) approximation, are examined as an alternative to the traditional power iteration method for the calculation of the fundamental eigenmode in reactor analysis applications based on diffusion theory. One JFNK approach can be considered an acceleration technique for the standard power iteration as it is “wrapped around” the power method, allowing for simplified implementation in preexisting codes. Since the Jacobian is not formed the only extra storage required is associated with the workspace of the Krylov solver used at every Newton step. Another Newton-based method is developed which solves the generalized eigenvalue problem formulation of the k-eigenvalue problem, both using the JFNK approximation and utilizing the action of the true Jacobian matrix. These Newton-based methods were compared to the unaccelerated and Chebyshev-accelerated power method for a number of reactor models. Results show calculation of the fundamental mode using JFNK acceleration of the power method generally results in fewer iterations and shorter run times than when using the unaccelerated and Chebyshev-accelerated power methods. The Newton-based approaches implemented for the solution of the generalized eigenvalue problem formulation of the k-eigenvalue problem are shown to exhibit poor convergence properties for the iterations associated with the linearized Newton step, highlighting the need for an effective preconditioner.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Preconditioned Generalized Minimal Residual Method for Solving Fractional Advection-Diffusion Equation

Introduction Fractional differential equations (FDEs)  have  attracted much attention and have been widely used in the fields of finance, physics, image processing, and biology, etc. It is not always possible to find an analytical solution for such equations. The approximate solution or numerical scheme  may be a good approach, particularly, the schemes in numerical linear algebra for solving ...

متن کامل

On Using Approximate Finite Differences in Matrix-Free Newton-Krylov Methods

A Newton–Krylov method is an implementation of Newton’s method in which a Krylov subspace method is used to solve approximately the linear systems that characterize steps of Newton’s method. Newton–Krylov methods are often implemented in “matrix-free” form, in which the Jacobian-vector products required by the Krylov solver are approximated by finite differences. Here we consider using approxim...

متن کامل

Fast spin up of Ocean biogeochemical models using matrix-free Newton–Krylov

A novel computational approach is introduced for the efficient computation of equilibrium solutions of seasonally forced ocean biogeochemical models. The essential idea is to formulate the problem as a large system of nonlinear algebraic equations to be solved with a class of methods known as matrix-free Newton–Krylov (MFNK). MFNK is a combination of Newton-type methods for superlinearly conver...

متن کامل

Nonsymmetric Preconditioner Updates in Newton-Krylov Methods for Nonlinear Systems

Newton-Krylov methods, combination of Newton-like methods and Krylov subspace methods for solving the Newton equations, often need adequate preconditioning in order to be successful. Approximations of the Jacobian matrices are required to form preconditioners and this step is very often the dominant cost of Newton-Krylov methods. Therefore, working with preconditioners destroys in principle the...

متن کامل

On Iterative Krylov-Dogleg Trust-Region Steps for Solving Neural Networks Nonlinear Least Squares Problems

This paper describes a method of dogleg trust-region steps, or restricted Levenberg-Marquardt steps, based on a projection process onto the Krylov subspaces for neural networks nonlinear least squares problems. In particular, the linear conjugate gradient (CG) method works as the inner iterative algorithm for solving the linearized Gauss-Newton normal equation, whereas the outer nonlinear algor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009